Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(s1(x), y) -> f2(x, s1(x))
f2(x, s1(y)) -> f2(y, x)

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(s1(x), y) -> f2(x, s1(x))
f2(x, s1(y)) -> f2(y, x)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F2(s1(x), y) -> F2(x, s1(x))
F2(x, s1(y)) -> F2(y, x)

The TRS R consists of the following rules:

f2(s1(x), y) -> f2(x, s1(x))
f2(x, s1(y)) -> f2(y, x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP

Q DP problem:
The TRS P consists of the following rules:

F2(s1(x), y) -> F2(x, s1(x))
F2(x, s1(y)) -> F2(y, x)

The TRS R consists of the following rules:

f2(s1(x), y) -> f2(x, s1(x))
f2(x, s1(y)) -> f2(y, x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.